second class constraint

second class constraint
第二类约束

English-Chinese dictionary of mechanical engineering (英汉机械工程大词典). 2013.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Second class constraints — In a constrained Hamiltonian system, a dynamical quantity is second class if its Poisson bracket with at least one constraint is nonvanishing. A constraint that has a nonzero Poisson bracket with at least one other constraint, then, is a second… …   Wikipedia

  • First class constraint — In Hamiltonian mechanics, consider a symplectic manifold M with a smooth Hamiltonian over it (for field theories, M would be infinite dimensional). Poisson bracketsSuppose we have some constraints : f i(x)=0, for n smooth functions :{ f i } {i=… …   Wikipedia

  • Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… …   Wikipedia

  • Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

  • Constraint counting — In mathematics, constraint counting is a crude but often useful way of counting the number of free functions needed to specify a solution to a partial differential equation. Contents 1 Einstein strength 1.1 Linear equations 1.2 General solution… …   Wikipedia

  • Second Stadtholderless Period — The Second Stadtholderless Period or Era ( nl. Tweede Stadhouderloze Tijdperk) is the designation in Dutch historiography of the period between the death of stadtholder William III on March 19 [This is the date from the Gregorian calendar that… …   Wikipedia

  • Local search (constraint satisfaction) — In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. It is based on iteratively improving an assignment of the variables until all constraints are satisfied. In particular, local search algorithms… …   Wikipedia

  • Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …   Wikipedia

  • Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… …   Wikipedia

  • Object Constraint Language — The Object Constraint Language (OCL) is a declarative language for describing rules that apply to Unified Modeling Language (UML) models developed at IBM and now part of the UML standard. Initially, OCL was only a formal specification language… …   Wikipedia

  • Victorian Railways H class — Infobox Locomotive name = Victorian Railways H class caption = Victorian Railways builder s photograph of H 220, 1941 powertype = steam data for = Victorian Railways H class builder = VR Newport Workshops whytetype = 4 8 4 numinclass = 1 length …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”